A Periodic Isoperimetric Problem Related to the Unique Games Conjecture
نویسنده
چکیده
We prove the endpoint case of a conjecture of Khot and Moshkovitz related to the Unique Games Conjecture, less a small error. Let n ≥ 2. Suppose a subset Ω of n-dimensional Euclidean space R satisfies −Ω = Ω and Ω + v = Ω for any standard basis vector v ∈ R. For any x = (x1, . . . , xn) ∈ R and for any q ≥ 1, let ‖x‖q = |x1| + · · · + |xn| and let γn(x) = (2π)−n/2e−‖x‖ 2 2/2 . For any x ∈ ∂Ω, let N(x) denote the exterior normal vector at x such that ‖N(x)‖2 = 1. Let B = {x ∈ R : sin(π(x1 + · · · + xn)) ≥ 0}. Our main result shows that B has the smallest Gaussian surface area among all such subsets Ω, less a small error: ∫ ∂Ω γn(x)dx ≥ (1− 6 · 10−9) ∫
منابع مشابه
Applications of Gaussian Noise Stability in Inapproximability and Social Choice Theory
Gaussian isoperimetric results have recently played an important role in proving fundamental results in hardness of approximation in computer science and in the study of voting schemes in social choice theory. In this thesis we prove a generalization of a Gaussian isoperimetric result by Borell and show that it implies that the majority function is optimal in Condorcet voting in the sense that ...
متن کاملMaximally Stable Gaussian Partitions with Discrete Applications
Gaussian noise stability results have recently played an important role in proving results in hardness of approximation in computer science and in the study of voting schemes in social choice. We prove a new Gaussian noise stability result generalizing an isoperimetric result by Borell on the heat kernel and derive as applications: • An optimality result for majority in the context of Condorcet...
متن کاملNew Maximally Stable Gaussian Partitions with Discrete Applications
Gaussian noise stability results have recently played an important role in proving fundamental results in hardness of approximation in computer science and in the study of voting schemes in social choice. We propose two Gaussian noise stability conjectures and derive consequences of the conjectures in hardness of approximation and social choice. Both conjectures generalize isoperimetric results...
متن کاملOn the Complexity of Unique Games and Graph Expansion
Understanding the complexity of approximating basic optimization problems is one of the grand challenges of theoretical computer science. In recent years, a sequence of works established that Khot’s Unique Games Conjecture, if true, would settle the approximability of many of these problems, making this conjecture a central open question of the field. The results of this thesis shed new light o...
متن کاملOn the Isoperimetric Problem in Euclidean Space with Density
We study the isoperimetric problem for Euclidean space endowedwith a continuous density. In dimension one, we characterize isoperimetric regions for a unimodal density. In higher dimensions, we prove existence results and we derive stability conditions, which lead to the conjecture that for a radial log-convex density, balls about the origin are isoperimetric regions. Finally, we prove this con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1708.00917 شماره
صفحات -
تاریخ انتشار 2017